Location:
Search - chess horse
Search list
Description: 将马随机放在国际象棋的8×8棋盘Board[0～7][0～7]的某个方格中，马按走棋规则进行移动。要求每个方格只进入一次，走遍棋盘上全部64个方格。编制非递归程序，求出马的行走路线，并按求出的行走路线，将数字1，2，…，64依次填入一个8×8的方阵，输出之
-The horses were placed in 8 × 8 chess board Board [0 ~ 7] [0 ~ 7] in a box, the horse in accordance with the rules for playing chess move. Required to enter each square only once, traveled all the 64 squares on a chessboard. The preparation of non-recursive procedures, seeking to lobby the walking routes, walking routes calculated in accordance with, the number 1,2, ..., 64, fill in an order of the 8 × 8 matrix, the output of
Platform: |
Size: 233472 |
Author: lipeng |
Hits:
Description: 骑士巡游问题：在n行n列的棋盘上（如n=5），假设一位骑士（按象棋中“马走日”的行走法）从初始坐标位置(x1，y1)出发，要遍访（巡游）棋盘中的每一个位置一次。请编一个程序，为骑士求解巡游“路线图”（或告诉骑士，从某位置出发时，无法遍访整个棋盘 — 问题无解）-Knight Parade Question: n row n column board (such as n = 5), assuming a knight (in chess in the " horse to go on" walking method) from the initial coordinates (x1, y1) starting to times Interview (Parade) board in the position of each of the first. Please compile a program to solve for the Knight Parade " road map" (or tell the knight, starting from a position when not visiting with the board- the problem no solution)
Platform: |
Size: 1024 |
Author: 吉玉 |
Hits:
Description: 数据结构课程设计——马的遍历：在中国象棋棋盘上，对任一位置上放置的一个马，均能选择一个合适的路线，使得该棋子能按象棋的规则不重复地走过棋盘上的每一位置。
要求：
（1）依次输出所走过的各位置的坐标。
（2）最好能画出棋盘的图形形式，并在其上动态地标注行走过程。
（3）程序能方便地地移植到其它规格的棋盘上。
-Data Structure Course Design- Horse traversal: the board in the Chinese chess on the location of any place of a horse, can choose an appropriate route, making the pieces according to chess rules can not repeatedly come on board each location. Requirements: (1) followed by the walk out the coordinates of each location. (2) best able to draw a graphical form of the board and mark on it dynamically during walking. (3) program can be easily transplanted to other specifications of the board.
Platform: |
Size: 49152 |
Author: |
Hits:
Description: 国际象棋中马的周游问题
给定一个8×8的棋盘，给定某一位置。求马从该位置出发，经过棋盘中的每一个方格恰好一次，最后回到它出发位置的路线图。
要求：用图形化动态演示马的行走路线、回溯过程。
-Travel chess problems in horses given a 8 × 8 chessboard, given a particular location. Horse from the starting seek position, after the board of each square exactly once, and finally back to its starting position of the road map. Requirements: Dynamic presentation with graphical horse routes, backtracking process.
Platform: |
Size: 26624 |
Author: yongyong |
Hits:
Description: 将马随机地放在国际象棋的8*8棋盘Board[8][8]的某个方格中，然后令马按走棋规则开始进行移动。要求马将棋盘上的每个方格进入且只进入一次，走遍全部64个方格。要求编制非递归程序，求出马的行走路线，将数字1，2，…，64依次填入一个8*8的方阵在屏幕上显示输出。-Ma randomly placed in the 8* 8 chess board Board [8] [8] in a box, and then that horse started under the rules for playing chess move. Asked Ma to the board each box to enter and only enter once, traveled all the 64 squares. Requested the preparation of non-recursive procedures, seeking to lobby the walking route, will be the number 1,2, ..., 64 in turn fill an 8* 8 squares on the screen display output.
Platform: |
Size: 2428928 |
Author: 王毅 |
Hits:
Description: 马塔棋盘的一个算法的描述，将马随机放在国际象棋的8×8棋盘Board[8][8]的某个方格中，马按走棋规则进行移动。要求每个方格只进入一次，走边棋盘上全部64个方格。编制非递归程序，求出马的行走路线，并按求出的行走路线，将数字1,2,3,…,64依次填入一个8×8的方阵，输出之。-Mata board of an algorithm description, the horses were placed in 8 × 8 chess board Board [8] [8] in a box, the horse in accordance with the rules for playing chess move. Required to enter each square only once, take the side of the board all the 64 squares. The preparation of non-recursive procedures, seeking to lobby the walking routes, walking routes calculated in accordance with, the number 1,2,3, ..., 64, fill in an order of the 8 × 8 matrix, output.
Platform: |
Size: 2048 |
Author: 猴哥 |
Hits:
Description: 天马行空（马走日字不重复地走完整张N*N棋盘）求解算法-This is the algorithm which can let the horse go all over the chess board without repeating.
Platform: |
Size: 2048 |
Author: 时风瞬 |
Hits:
Description: 在一个n*n个方格的国际象棋棋盘上，马（骑士）从任意指定方格出发，按照横1 步竖2 步，或横2 步竖1步的跳马规则，走遍棋盘的每一个格子，且每个格子只走1次。这样的跳马步骤称为1 个成功的骑士征途。例如，当n=5 时的1 个成功的骑士征途如下图所示。
1 2 3 4 5
1 25 14 1 8 19
2 4 9 18 13 2
3 15 24 3 20 7
4 10 5 22 17 12
5 23 16 11 6 21
算法设计：
对于给定的n和n*n方格的起始位置x和y。用分支限界法找出从指定的方格(x,y)出发的一条成功的骑士征途。
数据输入：
第一行有1 个正整数n (1≤n≤10)；第二行有2 个正整
数x 和y，表示骑士的起始位置为(x,y)。
结果输出:
如果不存在从(x,y)出发的成功的骑士征途则输出’No Solution!’。
输入：
5
1 3
输出
25 14 1 8 19
4 9 18 13 2
15 24 3 20 7
10 5 22 17 12
23 16 11 6 21-In an n* n squares on the chess board, horse (knight) starting from any given square, erected in accordance with step 1 step 2 horizontal, vertical or horizontal-step 1 step 2 vault rules, traveled to every board lattice, and each grid only take 1. This step is called a successful vault knights journey. For example, when n = 5 when a successful knight journey as shown below.
12345
125,141,819
24,918,132
315,243,207
4105221712
5231611621
Algorithm Design:
For a given n and n* n grid starting position of the x and y. Using branch and bound method to find out from the specified grid (x, y) starting a successful journey Knight.
Data entry:
The first line has a positive integer n (1 ≤ n ≤ 10) the second line has two positive integers
Number of x and y, said Cleveland s starting position (x, y).
The resulting output:
If not from the (x, y) the success of the Knights start the journey is the output No Solution! .
Input:
5
13
Export
25,141,819
4918132
Platform: |
Size: 881664 |
Author: wakaka |
Hits:
Description: 在一个具有8×8个方格的国际象棋盘上，从棋盘的任何一个方格开始，让马按照允许的走步规则（L形走法）走遍所有方格，每个方格至少并且只准走过一次。-In an 8 × 8 squares on the international chess board,start from any squar of chess board,Walking the horse in accordance with the rules allowed (L-shaped moves) traveled all the squars,Each squar and will only be allowed through at least once
Platform: |
Size: 165888 |
Author: 周阳宝 |
Hits:
Description: 编写程序求解骑士巡游问题：在n行n列的棋盘上（如n=5），假设一位骑士（按象棋中“马走日”的行走法）从初始坐标位置(x1，y1)出发，要遍访（巡游）棋盘中的每一个位置一次。请编一个程序，为骑士求解巡游“路线图”（或告诉骑士，从某位置出发时，无法遍访整个棋盘 — 问题无解）。
当n=5时，意味着要在5行5列的棋盘的25个“点”处，按骑士行走规则，依次将1至25这25个“棋子”（数码）分别摆放到棋盘上（摆满25个位置则成功，否则失败问题无解）。
-Knight Parade programming to solve the problem: In the n-n chessboard (for example, n = 5), assuming a knight (in chess in the " horse to go on" walk method) from the initial coordinates (x1, y1) starting , to be visited (cruise) position in each of the board once. Please compile a program to solve for the Knight Parade " road map" (or tell the knight, starting from a position, you can not visited the board- problem has no solution.) When n = 5, meaning 5 rows 5 columns in the board' s 25 " points" at, according to Knight walking rule, in turn 1 to 25 of these 25 " pieces" (digital) were placed into the board ( 25 positions were filled with success, or failure problem has no solution.)
Platform: |
Size: 2048 |
Author: 赵汉卿 |
Hits:
Description: 对象棋中的马走日进行分析，实现马走日的搜索算法。-The horse walked on at chess analysis, implementation and gallop away on the search algorithm.
Platform: |
Size: 66560 |
Author: licunli |
Hits:
Description: 在n行n列的棋盘上（如n=5），假设一位骑士（按象棋中“马走日”的行走法）从初始坐标位置(x1，y1)出发，要遍访（巡游）棋盘中的每一个位置一次。请编一个程序，为骑士求解巡游“路线图”（或告诉骑士，从某位置出发时，无法遍访整个棋盘 — 问题无解）。-In the n-n chessboard (for example, n = 5), assuming a knight (in chess in the " horse to go on" walk method) from the initial coordinates (x1, y1) starting to visited (Parade) Each board in the first place. Please compile a program to solve for the Knight Parade " road map" (or tell the knight, starting from a position, you can not visited the board- problem has no solution.)
Platform: |
Size: 133120 |
Author: 蔡哲文 |
Hits:
Description: 跳马算法的实现：考虑国际象棋棋盘上某个位置的一只马，它是否可能只走步，正好走过除起点外的其他个位置各一次，并且最后能够回到初始点（存在哈密顿回路）？-Vault algorithm implementation: considering a location on the chess board of a horse, it may only be walking, just walk in addition to other locations outside the starting point each time, and finally be able to return to the initial point (Hamiltonian circuit )?
Platform: |
Size: 227328 |
Author: zhaoxin |
Hits:
Description: Horse moves in the chess board (Translate pt.: movimento do cavalo no xadrez).
Platform: |
Size: 35840 |
Author: costa3112 |
Hits:
Description: 数据结构实习里面关于国际象棋马的遍历问题 自己编写-Data structures inside the internship through on chess problems to write your own horse
Platform: |
Size: 2479104 |
Author: efgdshgds |
Hits:
Description: 在国际象棋中，马的走法与中车象棋类似，即俗话说的“马走日”，下图所示即国际象棋中马（K）在一步能到达的格子（其中黑色的格子是能到达的位置）。
现有一200*200大小的国际象棋棋盘，棋盘中仅有一个马，给定马的当前位置（S）和目标位置（T），求出马最少需要多少跳才能从当前位置到达目标位置。
-In chess, in the way of the horse and cart similar to chess, that is, the saying goes "walking day", as shown in the following figure is horse chess (k) in one can reach the grid (black Plaid was able to reach the location). Existing 200*200 the size of the chess board, only one horse in the Board, given the current position of the horse (s) and destination (t), and hands at least need to jump to from the current position to the target location.
Platform: |
Size: 2048 |
Author: 李纪伟 |
Hits:
Description: A star算法求解的国际象棋骑士，也就是马从一个位置走到另一个位置的最小步数。-A star algorithm chess knight, it is a horse from one location to another location of the minimum number of steps.
Platform: |
Size: 913408 |
Author: kexitan |
Hits:
Description: 实现了人和人对战的象棋，而且马瘪腿，并不能后退-Realized and the game of chess, and the horse shriveled legs, and can not turn back
Platform: |
Size: 49152 |
Author: 海鹏 |
Hits:
Description: 在西洋棋中的武士（knight）与象棋中的马相似，走的是L型路线，输入一个表示期盼的大小值n，在输入一个起点坐标，找出一条从那一个起点，可以让武士棋走完n*n格而不重复的路径-Samurai (knight) in chess and chess in the horse is taking the L-shaped route, enter a size value n looking forward to enter a starting point coordinates, to identify one from that one starting point, allows the warriorchess has completed the n* n grid rather than duplicate path
Platform: |
Size: 1024 |
Author: 熊智亮 |
Hits:
Description: 马踏棋盘，马子在中国象棋棋盘上实现无返回走回所有路程，采用递归，打印出所有设计方案-Horse riding board on the chess board in China, Ma no return back to the all away, using recursion to print out all design
Platform: |
Size: 182272 |
Author: 章杰 |
Hits: